Hierarchic Superposition: Completeness without Compactness
Identifieur interne : 000F00 ( Main/Exploration ); précédent : 000E99; suivant : 000F01Hierarchic Superposition: Completeness without Compactness
Auteurs : Peter Baumgartner [Australie] ; Uwe Waldmann [Allemagne]Source :
Abstract
Many applications of automated deduction and verification require reasoning in combinations of theories, such as, on the one hand (some fragment of) first-order logic, and on, the other hand a background theory, such as some form of arithmetic. Unfortunately, due to the high expressivity of the full logic, complete reasoning is impossible in general. It is a realistic goal, however, to devise theorem provers that are "reasonably complete" in practice, and the hierarchic superposition calculus has been designed as a theoretical basis for that. In a recent paper we introduced an extension of hierarchic superposition and proved its completeness for the fragment where every term of the background sort is ground. In this paper, we extend this result and obtain completeness for a larger fragment that admits variables in certain places.
Url:
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 002773
- to stream Hal, to step Curation: 002773
- to stream Hal, to step Checkpoint: 000D96
- to stream Main, to step Merge: 000F10
- to stream Main, to step Curation: 000F00
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Hierarchic Superposition: Completeness without Compactness</title><author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-397678" status="INCOMING"><orgName>Software Systems Research Group</orgName><desc><address><country key="AU"></country></address></desc><listRelation><relation active="#struct-227648" type="direct"></relation><relation active="#struct-300765" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-227648" type="direct"><org type="laboratory" xml:id="struct-227648" status="VALID"><orgName>NICTA [Eveleigh]</orgName><desc><address><addrLine>Australian Technology Park Level 5, 13 Garden Street Eveleigh NSW 2015</addrLine><country key="AU"></country></address><ref type="url">http://nicta.com.au/</ref></desc><listRelation><relation active="#struct-300765" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300765" type="indirect"><org type="institution" xml:id="struct-300765" status="VALID"><orgName>National ICT Australia - NICTA</orgName><desc><address><addrLine>Australian Technology Park - Level 5, 13 Garden Street - Eveleigh NSW 2015</addrLine><country key="AU"></country></address><ref type="url">https://www.nicta.com.au</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Australie</country></affiliation></author><author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-54489" status="VALID"><orgName>Max Planck Institut für Informatik</orgName><orgName type="acronym">MPII</orgName><desc><address><addrLine>Max Planck Institut für Informatik Campus E-1 4 66123 Saarbrücken Germany</addrLine><country key="DE"></country></address><ref type="url">http://www.mpi-inf.mpg.de/</ref></desc><listRelation><relation active="#struct-300044" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300044" type="direct"><org type="institution" xml:id="struct-300044" status="VALID"><orgName>Max-Planck-Institut</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country><orgName type="university">Société Max-Planck</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-01087872</idno><idno type="halId">hal-01087872</idno><idno type="halUri">https://hal.inria.fr/hal-01087872</idno><idno type="url">https://hal.inria.fr/hal-01087872</idno><date when="2013-12-11">2013-12-11</date><idno type="wicri:Area/Hal/Corpus">002773</idno><idno type="wicri:Area/Hal/Curation">002773</idno><idno type="wicri:Area/Hal/Checkpoint">000D96</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000D96</idno><idno type="wicri:Area/Main/Merge">000F10</idno><idno type="wicri:Area/Main/Curation">000F00</idno><idno type="wicri:Area/Main/Exploration">000F00</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Hierarchic Superposition: Completeness without Compactness</title><author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-397678" status="INCOMING"><orgName>Software Systems Research Group</orgName><desc><address><country key="AU"></country></address></desc><listRelation><relation active="#struct-227648" type="direct"></relation><relation active="#struct-300765" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-227648" type="direct"><org type="laboratory" xml:id="struct-227648" status="VALID"><orgName>NICTA [Eveleigh]</orgName><desc><address><addrLine>Australian Technology Park Level 5, 13 Garden Street Eveleigh NSW 2015</addrLine><country key="AU"></country></address><ref type="url">http://nicta.com.au/</ref></desc><listRelation><relation active="#struct-300765" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300765" type="indirect"><org type="institution" xml:id="struct-300765" status="VALID"><orgName>National ICT Australia - NICTA</orgName><desc><address><addrLine>Australian Technology Park - Level 5, 13 Garden Street - Eveleigh NSW 2015</addrLine><country key="AU"></country></address><ref type="url">https://www.nicta.com.au</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Australie</country></affiliation></author><author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-54489" status="VALID"><orgName>Max Planck Institut für Informatik</orgName><orgName type="acronym">MPII</orgName><desc><address><addrLine>Max Planck Institut für Informatik Campus E-1 4 66123 Saarbrücken Germany</addrLine><country key="DE"></country></address><ref type="url">http://www.mpi-inf.mpg.de/</ref></desc><listRelation><relation active="#struct-300044" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300044" type="direct"><org type="institution" xml:id="struct-300044" status="VALID"><orgName>Max-Planck-Institut</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country><orgName type="university">Société Max-Planck</orgName></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Many applications of automated deduction and verification require reasoning in combinations of theories, such as, on the one hand (some fragment of) first-order logic, and on, the other hand a background theory, such as some form of arithmetic. Unfortunately, due to the high expressivity of the full logic, complete reasoning is impossible in general. It is a realistic goal, however, to devise theorem provers that are "reasonably complete" in practice, and the hierarchic superposition calculus has been designed as a theoretical basis for that. In a recent paper we introduced an extension of hierarchic superposition and proved its completeness for the fragment where every term of the background sort is ground. In this paper, we extend this result and obtain completeness for a larger fragment that admits variables in certain places.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Australie</li></country><orgName><li>Société Max-Planck</li></orgName></list><tree><country name="Australie"><noRegion><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name></noRegion></country><country name="Allemagne"><noRegion><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F00 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000F00 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Hal:hal-01087872
|texte= Hierarchic Superposition: Completeness without Compactness
}}
| This area was generated with Dilib version V0.6.33. |  |